Measuring Anonymity with Relative Entropy
نویسندگان
چکیده
Anonymity is the property of maintaining secret the identity of users performing a certain action. Anonymity protocols often use random mechanisms which can be described probabilistically. In this paper, we propose a probabilistic process calculus to describe protocols for ensuring anonymity, and we use the notion of relative entropy from information theory to measure the degree of anonymity these protocols can guarantee. Furthermore, we prove that the operators in the probabilistic process calculus are non-expansive, with respect to this measuring method. We illustrate our approach by using the example of the Dining Cryptographers Problem.
منابع مشابه
Plausibilistic Entropy and Anonymity
A common approach behind measuring anonymity is that the larger the anonymity set is the higher the degree of anonymity it supports. Our approach builds upon this intuition proposing a very general and yet precise measure for security properties. Introduced in a paper accepted for ARES 2013 conference, plausibilistic entropy promises to offer an expressive and cost effective solution for quanti...
متن کاملMeasuring anonymity: a few thoughts and a differentially private bound
Measuring the quality of protection offered by security mechanisms, including anonymous channels, is of paramount importance. It allows architects to compare designs, and reliably improve them. It also allows them to understand the impact improvements in other aspects of a design, for reliability, performance or usability, may have on the overall security of systems. In the absence of security ...
متن کاملThe Mis-entropists: New Approaches to Measures in Tor
Measuring path compromise in the anonymity system Tor is a problem of important and immediate interest. We discuss the drawbacks to the traditional anonymity network measure—entropy—and explore the advantages of an attackbased measure. Our perspective is that of an adversary with a bandwidth budget (a fixed amount of bandwidth he or she can compromise), and we derive theoretical and numerical r...
متن کاملAnonymity and Covert Channels in Simple Timed Mix-Firewalls
Traditional methods for evaluating the amount of anonymity afforded by various Mix configurations have depended on either measuring the size of the set of possible senders of a particular message (the anonymity set size), or by measuring the entropy associated with the probability distribution of the messages possible senders. This paper explores further an alternative way of assessing the anon...
متن کاملAnonymity and Covert Channels in Simple Timed Mix- rewalls
Traditional methods for evaluating the amount of anonymity a orded by various Mix con gurations have depended on either measuring the size of the set of possible senders of a particular message (the anonymity set size), or by measuring the entropy associated with the probability distribution of the messages possible senders. This paper explores further an alternative way of assessing the anonym...
متن کامل